Sixth International Symposium on Symbolic Computation in Software Science
نویسندگان
چکیده
Generalization problems arise in many areas of software science: code clone detection, program reuse, partial evaluation, program synthesis, invariant generation, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open-source library of some newly developed anti-unification algorithms in various theories: for firstand second-order unranked terms, higher-order patterns, and nominal terms.
منابع مشابه
Special issue on symbolic computation in software science
This special issue of the Journal of Symbolic Computation is related to the Fourth and Fifth International Symposia on Symbolic Computation in Software Science, SCSS 2012 and SCSS 2013, held, respectively, in Gammarth, Tunisia, December 15–17, 2012 and in Hagenberg, Austria, July 5–6, 2013. After an open call for papers, we received 18 submissions, six of which have been selected for publicatio...
متن کاملSymbolic and Algebraic Computation, International Symposium ISSAC'88, Rome, Italy, July 4-8, 1988, Proceedings
What do you do to start reading symbolic and algebraic computation international symposium issac 88 rome italy july 4 8 1988 p? Searching the book that you love to read first or find an interesting book that will make you want to read? Everybody has difference with their reason of reading a book. Actuary, reading habit must be from earlier. Many people may be love to read, but not a book. It's ...
متن کاملAn Optimising Compiler for a Modern Functional Language
ion (detailed summary). In Proceedings 1986 ACMConference on LISP and Functional Programming, pp.351-363. ACM (August, 1986).13. P. Hudak, A. Bloss and J. Young, Code optimizations for lazy evaluation. Lisp and Symbolic Computation: An International Journal1 (2), 147-1 64 (1988).And a s always, we thank the 'grapplers' a t Yale for their never-ending support. 14. P. Hudak an...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملSymbolic Computation and Complexity Theory Transcript of My Talk
I gave talks at the conference Alan Turing’s Heritage: Logic, Computation & Complexity in Lyon, France on July 3, 2012, at the Pierre and Marie Curie University (UPMC) Paris 6, France on July 17, 2012, and at the Tenth Asian Symposium on Computer Mathematics (ASCM) in Beijing, China on October 26, 2012 on the complexity theoretic hardness of many problems that the discipline of symbolic computa...
متن کامل